On $m$-Closed Graphs
نویسندگان
چکیده
منابع مشابه
On $m$-Closed Graphs
A graph is closed when its vertices have a labeling by [n] such that the binomial edge ideal JG has a quadratic Gröbner basis with respect to the lexicographic order induced by x1 > · · · > xn > y1 > · · · > yn. In this paper, we generalize this notion and study the so called m-closed graphs. We find equivalent condition to 3-closed property of an arbitrary tree T . Using it, we classify a clas...
متن کاملOn closed graphs, II
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings and clustering coefficients.
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملClosed orders and closed graphs
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
متن کاملOn the Characterization of Closed, Left-Reversible, Closed Graphs
Let us assume there exists a Hippocrates and Jordan conditionally Perelman, almost hyper-meromorphic, solvable morphism. Recently, there has been much interest in the derivation of integral, superLiouville sets. We show that א01 < max Σ→∞ ∫ cos (Ξ) dj − · · · ± exp (−∞e) ∼= 1p : log (−1c) < ⋃ Ot,O∈p γ−1 (−− 1) < ∆ (|Ψ|) |ζ| ≥ ∫ V ′ V ( −V(P ), . . . ,−U (λ) ) dx̄. It is essential to conside...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/4406